THE DIAMETER AND RADIUS OF RADIALLY MAXIMAL GRAPHS
نویسندگان
چکیده
A graph is called radially maximal if it not complete and the addition of any new edge decreases its radius. In 1976 Harary Thomassen proved that radius $r$ diameter $d$ satisfy $r\le d\le 2r-2.$ Dutton, Medidi Brigham rediscovered this result with a different proof in 1995 they posed conjecture converse true, is, are positive integers satisfying 2r-2,$ then there exists $d.$ We prove little more.
منابع مشابه
Minimal non-selfcentric radially-maximal graphs of radius 4
There is a hypothesis that a non-selfcentric radially-maximal graph of radius r has at least 3r − 1 vertices. Using some recent results we prove this hypothesis for r = 4.
متن کاملOn radially maximal graphs
A graph is radially maximal if its radius decreases after the addition of any edge of its complement. It is proved that any graph can be an induced subgraph of a regular radially maximal graph with a prescribed radius T 2: 3. For T 2: 4, k 2: 1, radially maximal graphs with radius T containing k cut-nodes are constructed.
متن کاملRadially Moore graphs of radius three and large odd degree
Extremal graphs which are close related to Moore graphs have been defined in different ways. Radially Moore graphs are one of these examples of extremal graphs. Although it is proved that radially Moore graphs exist for radius two, the general problem remains open. Knor, and independently Exoo, gives some constructions of these extremal graphs for radius three and small degrees. As far as we kn...
متن کاملGraphs with specified radius and diameter
The radius and diameter of a graph are known to satisfy the relation rad G < diam C 5 2 rad G. We show that this is the only restriction on these parameters and construl*t all nonisomorphic graphs of minimal order having a specified radius and diameter. In a graph G the diameter is diam G = ma,\_inax, d(tc, u) and the radius is rad G = min, max, d(tl, u), the min and max being taken over all po...
متن کاملGeneralized eccentricity, radius, and diameter in graphs
For a vertex v and a (k−1)-element subset P of vertices of a graph, one can define the distance from v to P in various ways, including the minimum, average, and maximum distance from v to P . Associated with each of these distances, one can define the keccentricity of the vertex v as the maximum distance over all P , and the k-eccentricity of the set P as the maximum distance over all v. If k =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of The Australian Mathematical Society
سال: 2021
ISSN: ['0004-9727', '1755-1633']
DOI: https://doi.org/10.1017/s0004972720001471